Dynamic Granular Locking Approach to Phantom Protection in R-Trees
نویسندگان
چکیده
Over the last decade, the R-tree has emerged as one of the most robust multidimensional access methods. However, before the R-tree can be integrated as an access method to a commercial strength database management system, e cient techniques to provide transactional access to data via R-trees need to be developed. Concurrent access to data through a multidimensional data structure introduces the problem of protecting ranges speci ed in the retrieval from phantom insertions and deletions (the phantom problem). Existing approaches to phantom protection in B-trees (namely, key-range locking) cannot be applied to multidimensional data structures since they rely on a total order over the key space on which the B-tree is designed. This paper presents a dynamic granular locking approach to phantom protection in R-trees. To the best of our knowledge, this paper provides the rst solution to the phantom problem in multidimensional access methods based on granular locking.
منابع مشابه
Granular Locking Approach to Phantom Protection in R - trees
Over the last decade, the R-tree has emerged as one of the most robust multidimensional access methods. However, before the R-tree can be integrated as an access method to a commercial strength database management system, eecient techniques to provide transactional access to data via R-trees need to be developed. Concurrent access to data through a multidi-mensional data structure introduces th...
متن کاملCombinational Approach for Object Clipping Using GLIP and Protection Against Sql Injection Attacks
Multidimensional databases are being used in a wide range of applications. To meet this fast-growing demand,R+ trees were used that exhibit outstanding search performance. In order to support efficient concurrent access in multiuser environments, concurrency control mechanisms for multidimensional indexing have been proposed. However, these mechanisms cannot be directly applied to the R+-tree b...
متن کاملUse of locking plate in combination with dynamic compression plate for repair of tibial fracture in a young horse
Grade 1 open spiral fracture of left tibia in a 1.5 year-old horse was treated using a combination of 4.5 mm locking compression plate (LCP) and a dynamic compression plate applied in a neutralization manner. The open wound was managed postoperatively by regular dressing and lavage. Radiograph at 24 days post-treatment revealed callus formation and at two months complete bridging callus was obs...
متن کاملOrthogonal key-value locking
B-trees have been ubiquitous for decades; and over the past 20 years, record-level locking has been ubiquitous in b-tree indexes. There are multiple designs, each a different tradeoff between (i) high concurrency and a fine granularity of locking for updates, (ii) efficient coarse locks for equality and range queries, (iii) run time efficiency with the fewest possible invocations of the lock ma...
متن کاملHigh-Concurrency Locking in R-Trees
In this paper we present a solution to the problem of concurrent operations in R-trees, a dynamic access structure capable of storing multidimensional and spatial data. We describe the R-link tree, a variant of the R-tree that adds sibling pointers to nodes, a technique rst deployed in B-link trees, to compensate for concurrent structure modi cations. The main obstacle to the use of sibling poi...
متن کامل